"deterministic Turing machine" meaning in English

See deterministic Turing machine in All languages combined, or Wiktionary

Noun

Forms: deterministic Turing machines [plural]
Head templates: {{en-noun}} deterministic Turing machine (plural deterministic Turing machines)
  1. (computer science) A Turing machine whose governing rules specify only one possible action for any given combination of the state of the machine and symbol being read. Categories (topical): Computer science

Inflected forms

{
  "forms": [
    {
      "form": "deterministic Turing machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "deterministic Turing machine (plural deterministic Turing machines)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "Coordinate term: nondeterministic Turing machine"
        }
      ],
      "glosses": [
        "A Turing machine whose governing rules specify only one possible action for any given combination of the state of the machine and symbol being read."
      ],
      "id": "en-deterministic_Turing_machine-en-noun-4lp4t2DN",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "Turing machine",
          "Turing machine"
        ],
        [
          "governing",
          "governing"
        ],
        [
          "rule",
          "rule"
        ],
        [
          "specify",
          "specify"
        ],
        [
          "possible",
          "possible"
        ],
        [
          "action",
          "action"
        ],
        [
          "given",
          "given"
        ],
        [
          "combination",
          "combination"
        ],
        [
          "state",
          "state"
        ],
        [
          "machine",
          "machine"
        ],
        [
          "symbol",
          "symbol"
        ]
      ],
      "raw_glosses": [
        "(computer science) A Turing machine whose governing rules specify only one possible action for any given combination of the state of the machine and symbol being read."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "deterministic Turing machine"
}
{
  "forms": [
    {
      "form": "deterministic Turing machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "deterministic Turing machine (plural deterministic Turing machines)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science"
      ],
      "examples": [
        {
          "text": "Coordinate term: nondeterministic Turing machine"
        }
      ],
      "glosses": [
        "A Turing machine whose governing rules specify only one possible action for any given combination of the state of the machine and symbol being read."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "Turing machine",
          "Turing machine"
        ],
        [
          "governing",
          "governing"
        ],
        [
          "rule",
          "rule"
        ],
        [
          "specify",
          "specify"
        ],
        [
          "possible",
          "possible"
        ],
        [
          "action",
          "action"
        ],
        [
          "given",
          "given"
        ],
        [
          "combination",
          "combination"
        ],
        [
          "state",
          "state"
        ],
        [
          "machine",
          "machine"
        ],
        [
          "symbol",
          "symbol"
        ]
      ],
      "raw_glosses": [
        "(computer science) A Turing machine whose governing rules specify only one possible action for any given combination of the state of the machine and symbol being read."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "deterministic Turing machine"
}

Download raw JSONL data for deterministic Turing machine meaning in English (1.4kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.